eTG complete, the complete Therapeutic Guidelines in electronic format

Weak complete parts in semihypergroups

In this article we generalize the notion of complete parts, by introducing a weaker condition in definition. Using this generalization we define and analyse a new class of semihypergroups, which are called weak complete semihypergroups. Complete parts were introduced about 40 years ago by M. Koskas and they represent a basic notion of hyperstucture theory, utilized in constructing an important ...

Complete colonic duplication in children

Background: Complete colonic duplication is a very rare congenital anomaly that may have different presentations according to its location and size. Complete colonic duplication can occur in 15% of gastrointestinal duplication. We report two cases of complete colonic duplications, and their characteristics. Case Presentation: We present two patients with complete colonic duplication with differ...

META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

The complete version of this issue

Complete Issue 2016-2